A Finite State and Data-Oriented Method for Grapheme to Phoneme Conversion
نویسنده
چکیده
A finite-state method, based on leftmost longestmatch replacement, is presented for segmenting words into graphemes, and for converting graphemes into phonemes. A small set of hand-crafted conversion rules for Dutch achieves a phoneme accuracy of over 93%. The accuracy of the system is further improved by using transformation-based learning. The phoneme accuracy of the best system (using a large rule and a ‘lazy’ variant of Brill’s algoritm), trained on only 40K words, reaches 99%.
منابع مشابه
Phoneme-to-grapheme conversion for out-of-vocabulary words in speech recognition
In this report, we show that Out-Of-Vocabulary items (OOVs), recognized using phoneme recognition, can be reasonably reliably transcribed orthographically using Machine Learning techniques. More specifically, (i) we show baseline performance of a machine learning approach to phoneme-to-grapheme conversion when different levels of artificial noise are added (simulating phoneme recognizer errors)...
متن کاملLanguage-independent Data-oriented Grapheme-to-phoneme Conversion
We describe an approach to grapheme-to-phoneme conversion which is both language-independent and data-oriented. Given a set of examples (spelling words with their associated phonetic representation) in a language, a grapheme-to-phoneme conversion system is automatically produced for that language which takes as its input the spelling of words, and produces as its output the phonetic transcripti...
متن کاملOptimizing phoneme-to-grapheme conversion for out-of-vocabulary words in speech recognition
In this report, we present the results of further research on phoneme-to-grapheme (P2G) conversion for Out-Of-Vocabulary items (OOVs), recognized using phoneme recognition, in large vocabulary speech recognition. First, we summarize the results of previous research, and then we start with reporting on several optimization strategies for the Machine Learning technique we used to carry out P2G co...
متن کاملA method for structure estimation of weighted finite-state transducers and its application to grapheme-to-phoneme conversion
Weighted finite-state transducers (WFSTs) are widely used as a fundamental data structure in several spoken language processing systems since they can provide a unified representation of many types of probabilistic models. Even though the use of accurate WFSTs is important in many spoken language systems, WFSTs are conventionally obtained by transforming probabilistic models that are not estima...
متن کاملLanguage � Independent Data � Oriented Grapheme
We describe an approach to grapheme to phoneme conver sion which is both language independent and data oriented Given a set of examples spelling words with their associated phonetic representation in a language a grapheme to phoneme conversion system is automatically pro duced for that language which takes as its input the spelling of words and produces as its output the phonetic transcription ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000